package algorithm.leetcode.lcp06;

import sun.reflect.generics.tree.Tree;

public class Solution {
    public int minCount(int[] coins) {


        int times = 0;
        for (int coin : coins) {
            times += (coin/2 + coin%2);
        }
        return times;
    }

    public static void main(String[] args) {
        int[] coins = {2,3,10};
        System.out.println(new Solution().minCount(coins));
    }
}